polynomial irreducibility - translation to russian
Diclib.com
ChatGPT AI Dictionary
Enter a word or phrase in any language 👆
Language:

Translation and analysis of words by ChatGPT artificial intelligence

On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:

  • how the word is used
  • frequency of use
  • it is used more often in oral or written speech
  • word translation options
  • usage examples (several phrases with translation)
  • etymology

polynomial irreducibility - translation to russian

THEOREM
Eisenstein polynomial; Eisenstein criterion; Eisenstein's Irreducibility Criterion; Eisenstein's irreducibility criterion; Eisenstein irreducibility criterion; Schönemann-Eisenstein theorem; Schönemann–Eisenstein theorem; Eisenstein Criterion

polynomial irreducibility      

математика

неприводимость многочленов

reducible polynomial         
IRREDUCIBLE ELEMENT IN THE RING OF POLYNOMIALS; A NON-CONSTANT POLYNOMIAL THAT IS NOT THE PRODUCT OF TWO NON-CONSTANT POLYNOMIALS
Prime polynomial; Reducible polynomial; Algorithms for factoring polynomials

математика

приводимый многочлен

irreducible polynomial         
IRREDUCIBLE ELEMENT IN THE RING OF POLYNOMIALS; A NON-CONSTANT POLYNOMIAL THAT IS NOT THE PRODUCT OF TWO NON-CONSTANT POLYNOMIALS
Prime polynomial; Reducible polynomial; Algorithms for factoring polynomials

общая лексика

неприводимый многочлен

неприводимый полином

Definition

Polynomial
·adj Containing many names or terms; multinominal; as, the polynomial theorem.
II. Polynomial ·noun An expression composed of two or more terms, connected by the signs plus or minus; as, a2 - 2ab + b2.
III. Polynomial ·adj Consisting of two or more words; having names consisting of two or more words; as, a polynomial name; polynomial nomenclature.

Wikipedia

Eisenstein's criterion

In mathematics, Eisenstein's criterion gives a sufficient condition for a polynomial with integer coefficients to be irreducible over the rational numbers – that is, for it to not be factorizable into the product of non-constant polynomials with rational coefficients.

This criterion is not applicable to all polynomials with integer coefficients that are irreducible over the rational numbers, but it does allow in certain important cases for irreducibility to be proved with very little effort. It may apply either directly or after transformation of the original polynomial.

This criterion is named after Gotthold Eisenstein. In the early 20th century, it was also known as the Schönemann–Eisenstein theorem because Theodor Schönemann was the first to publish it.

What is the Russian for polynomial irreducibility? Translation of &#39polynomial irreducibility&#39